New Bayesian Method for Multiextremal Optimization
نویسندگان
چکیده
منابع مشابه
solution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Test Problems for Lipschitz Univariate Global Optimization with Multiextremal Constraints
Abstract. In this paper, Lipschitz univariate constrained global optimization problems where both the objective function and constraints can be multiextremal are considered. Two sets of test problems are introduced, in the first one both the objective function and constraints are differentiable functions and in the second one they are non-differentiable. Each series of tests contains 3 problems...
متن کاملThe Parallel Knowledge Gradient Method for Batch Bayesian Optimization
In many applications of black-box optimization, one can evaluate multiple points simultaneously, e.g. when evaluating the performances of several different neural network architectures in a parallel computing environment. In this paper, we develop a novel batch Bayesian optimization algorithm — the parallel knowledge gradient method. By construction, this method provides the one-step Bayes opti...
متن کاملIndex Information Algorithm with Local Tuning for Solving Multidimensional Global Optimization Problems with Multiextremal Constraints
Multidimensional optimization problems where the objective function and the constraints are multiextremal non-differentiable Lipschitz functions (with unknown Lipschitz constants) and the feasible region is a finite collection of robust nonconvex subregions are considered. Both the objective function and the constraints may be partially defined. To solve such problems an algorithm is proposed, ...
متن کاملA new integral loss function for Bayesian optimization
We consider the problem of maximizing a real-valued continuous function f using a Bayesian approach. Since the early work of Jonas Mockus and Antanas Žilinskas in the 70’s, the problem of optimization is usually formulated by considering the loss function max f − Mn (where Mn denotes the best function value observed after n evaluations of f ). This loss function puts emphasis on the value of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Science and Techniques
سال: 2020
ISSN: 2029-9966
DOI: 10.15181/csat.v7i0.1956